Precise lower bound of f(A)-f(B) for A>B>0 and non-constant operator monotone function f on [0,∞)

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bound for monotone Boolean convolution

Any monotone Boolean circuit computing the n-dimensional Boolean convolution requires at least n2 and-gates. This matches the obvious upper bound. The previous best bound for this problem was Ω(n4/3), obtained by Norbert Blum in 1981. More generally, exact bounds are given for all semi-disjoint bilinear forms.

متن کامل

Monotone depth lower bound for st connectivity

In Lecture 2, we saw how communication complexity lower bounds yield lower bounds for circuit depth. In particular, we showed that for any function f , D(KWf ) = depth(f) and D(KW f ) = depth (f), where KWf denotes the Karchmer-Wigderson game on f . Using this, we showed that monotone circuits for matching require Ω(n) depth. In this lecture we will show that circuits solving directed s-t conne...

متن کامل

A Lower Bound on the Cesaro Operator

If the sequence a = (a„>^ E /2, i.e., ||a||2 = 2~=0 | a„ |2 < oo, define Sa as the sequence of averages 1 " 2 ak n + 1 , It follows easily from the Marcinkiewicz Interpolation Theorem that S is a bounded operator from I2 to I2; this can also be proved directly using the Cauchy-Buniakowski-Schwarz inequality [1]. S is known as the Cesàro operator. S is, of course, not bounded below, but the foll...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Inequalities

سال: 2015

ISSN: 1846-579X

DOI: 10.7153/jmi-09-04